Beyond Contention: Extending Texture-Based Scheduling Heuristics
نویسندگان
چکیده
In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture measurement to a measure of the probability that a constraint will be broken. We define three methods for the estimation of this probability and show that they perform as well or better than existing heuristics on job shop scheduling problems. Empirical insight into the performance is provided and we sketch how we have extended probability-based heuristics to more complicated scheduling constraints.
منابع مشابه
Comparison of lightweight and compute - intensive heuristics for DAG scheduling with network contention
The aim of this Master’s thesis is the investigation of schedule qualities by extending the HEFT algorithm and a Genetic Algorithm to contention-aware scheduling heuristics. Both algorithms are modified in terms of transfer times for simultaneously data connections inside the cluster to explore potential advantages of the GA on the one hand, and the increasing complexity of the problem on the o...
متن کاملResource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals expected to have the best worst case resource availability. Prior research in value and variable ordering heuristics for scheduling problems indicated that sophisticated, but more costly measures of resource contentio...
متن کاملComparison of Contention Aware List Scheduling Heuristics for Cluster Computing
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware sch...
متن کاملList scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a directed acyclic graph (DAG) to a target system. As most scheduling heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the communication links. This article extends the list scheduling heuristic for contention aware...
متن کاملA Dynamic Communication Contention Awareness List Scheduling Algorithm for Arbitrary Heterogeneous System
Task scheduling is an essential aspect of parallel process system. Most heuristics for this NP-hard problem assume fully connected homogeneous processors and ignore contention on the communication links. Actually, contention for communication resources has a strong influence on the execution time of a parallel program in arbitrary network topology heterogeneous system. This paper investigates t...
متن کامل